The Graph of Integer Multiplication is Hard for Read-k-Times Networks
نویسنده
چکیده
We prove that the graph of integer multiplication requires non-deterministic read-k-times branching programs of exponential size. On the other hand we show that one can add polynomially many integers by small determin-istic read-once-only branching programs. This shows that the reason for the hardness of multiplication is not the necessity to add many integers (and hence, to get rid of the carry numbers) but the necessity to add diierent subsets of these integers.
منابع مشابه
A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs
We prove an exponential lower bound 2 (n= logn) on the size of any randomized ordered read-once branching program computing integer multiplication. Our proof depends on proving a new lower bound on Yao's randomized one-way communication complexity of certain boolean functions. It generalizes to some other common models of randomized branching programs. In contrast, we prove that testing integer...
متن کاملA lower bound for integer multiplication on randomized ordered read-once branching programs
We prove an exponential lower bound (2 (n= log n)) on the size of any randomized ordered read-once branching program computing integer multiplication. Our proof depends on proving a new lower bound on Yao's ran-domized one-way communication complexity of certain boolean functions. It generalizes to some other common models of random-ized branching programs. In contrast, we prove that testing in...
متن کاملThe small intersection graph relative to multiplication modules
Let $R$ be a commutative ring and let $M$ be an $R$-module. We define the small intersection graph $G(M)$ of $M$ with all non-small proper submodules of $M$ as vertices and two distinct vertices $N, K$ are adjacent if and only if $Ncap K$ is a non-small submodule of $M$. In this article, we investigate the interplay between the graph-theoretic properties of $G(M)$ and algebraic properties of $M...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Universität Trier, Mathematik/Informatik, Forschungsbericht
دوره 95-10 شماره
صفحات -
تاریخ انتشار 1995